Probabilistic graded rough set and double relative quantitative decision-theoretic rough set
نویسندگان
چکیده
منابع مشابه
Double-quantitative decision-theoretic rough set
The probabilistic rough set (PRS) and the graded rough set (GRS) are two quantification models that measure relative and absolute quantitative information between the equivalence class and a basic concept, respectively. As a special PRS model, the decision-theoretic rough set (DTRS) mainly utilizes the conditional probability to express relative quantification. However, it ignores absolute quan...
متن کاملGeneralized multigranulation double-quantitative decision-theoretic rough set
The principle of the minority subordinate to the majority is the most feasible and credible when people make decisions in real world. So generalized multigranulation rough set theory is a desirable fusion method, in which upper and lower approximations are approximated by granular structures satisfying a certain level of information. However, the relationship between a equivalence class and a c...
متن کاملDecision-Theoretic Rough Set Models
Decision-theoretic rough set models are a probabilistic extension of the algebraic rough set model. The required parameters for defining probabilistic lower and upper approximations are calculated based on more familiar notions of costs (risks) through the well-known Bayesian decision procedure. We review and revisit the decision-theoretic models and present new results. It is shown that we nee...
متن کاملProbabilistic rough set approximations
Probabilistic approaches have been applied to the theory of rough set in several forms, including decision-theoretic analysis, variable precision analysis, and information-theoretic analysis. Based on rough membership functions and rough inclusion functions, we revisit probabilistic rough set approximation operators and present a critical review of existing studies. Intuitively, they are define...
متن کاملDouble Successive Rough Set Approximations
We examine double successive approximations on a set, which we denote by L2L1, U2U1, U2L1, L2U1 where L1, U1 and L2, U2 are based on generally non-equivalent equivalence relations E1 and E2 respectively, on a finite non-empty set V. We consider the case of these operators being given fully defined on its powerset P(V ). Then, we investigate if we can reconstruct the equivalence relations which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2016
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2016.03.004